How to Transform Canonical Decreasing CTRSs into Equivalent Canonical TRSs
نویسنده
چکیده
We prove constructively that the class of ground-connuent and decreasing conditional term rewriting systems (CTRSs) (without extra variables) coincides with the class of orthogonal and terminating , unconditional term rewriting systems (TRSs). TRSs being included in CTRSs, this result follows from a transformation from any ground-connuent and decreasing CTRS specifying a computable function f into a TRS with the mentioned properties for f. The generated TRS is order-sorted, but we outline a similar transformation yielding an unsorted TRS.
منابع مشابه
Sampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملOn interreduction of semi-complete term rewriting systems
For a complete, i.e., connuent and terminating term rewriting system (TRS) it is well-known that simpliication (also called interreduction) into an equivalent canonical, i.e., complete and interreduced TRS is easily possible. This can be achieved by rst normalizing all right-hand sides of the TRS and then deleting all rules with a reducible left-hand side. Here we investigate the logical and op...
متن کاملGeneration of a TRS Implementing the Inverses of the Functions with Specified Arguments Fixed
In this paper, we propose an algorithm for generating a TRS implementing the inverses of the functions with specified arguments fixed. At first, we propose an algorithm InvCT RS0 for generating inverse CTRSs for constructor TRSs. Next, we extend InvCT RS0 to the algorithm InvCT RSI for the functions with specified arguments fixed. Finally, we show that our inverse CTRSs can be transformed to TR...
متن کاملSoundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
Unravelings are transformations from conditional term rewriting systems(CTRSs) into unconditional term rewriting systems (TRSs) over extended signatures.They are complete, but in general, not sound w.r.t. reduction. Here, soundness w.r.t. reduction for a CTRS means that for every term over the original signature of the CTRS,if the corresponding unraveled TRS reduces the term to a te...
متن کاملCanonical representation for approximating solution of fuzzy polynomial equations
In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994